Equilibrium Customer Strategies in the Queue with Threshold Policy and Setup Times
نویسندگان
چکیده
منابع مشابه
Steady-State Queue Length Analysis of a Batch Arrival Queue under N-Policy with Single Vacation and Setup Times
This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N , the server is immediately turned on but is temporarily unava...
متن کاملCustomer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control
We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the system state at the moment of arrival. We show that due to service rate variation, the customer equilibrium strategy is not generally unique, and derive an upper ...
متن کاملEquilibrium Customer Strategies and Social-profit Maximization in the Single Server Constant Retrial Queue
We consider the single server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for ...
متن کاملOn transient queue - size distribution in the batch arrival system with the N - policy and setup times ∗
In the paper the M/G/1 queueing system with the N -policy and setup times is considered. An explicit formula for the Laplace transform of the transient queue-size distribution is derived using the approach consisting of few steps. Firstly, a “special” modification of the original system is investigated and, using the formula of total probability, the analysis is reduced to the case of the corre...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/361901